Efficient Irreversible Monte Carlo Samplers
نویسندگان
چکیده
منابع مشابه
Sequential Monte Carlo Samplers
In this paper, we propose a methodology to sample sequentially from a sequence of probability distributions known up to a normalizing constant and defined on a common space. These probability distributions are approximated by a cloud of weighted random samples which are propagated over time using Sequential Monte Carlo methods. This methodology allows us to derive simple algorithms to make para...
متن کاملIrreversible Monte Carlo Algorithms for Efficient Sampling
Equilibrium systems evolve according to Detailed Balance (DB). This principe guided development of the Monte-Carlo sampling techniques, of which Metropolis-Hastings (MH) algorithm is the famous representative. It is also known that DB is sufficient but not necessary. We construct irreversible deformation of a given reversible algorithm capable of dramatic improvement of sampling from known dist...
متن کاملSequential Monte Carlo Samplers for Rare Events
We present novel sequential Monte Carlo (SMC) algorithms for the simulation of two broad classes of rare events which are suitable for the estimation of tail probabilities and probability density functions in the regions of rare events, as well as the simulation of rare system trajectories. These methods have some connection with previously proposed importance sampling (IS) and interacting part...
متن کاملPopulation Monte Carlo Samplers for Rendering
We present novel samplers and algorithms for Monte Carlo rendering. The adaptive image-plane sampler selects pixels for refinement according to a perceptually-weighted variance criteria. The hemispheric integrals sampler learns an importance sampling function for computing common rendering integrals. Both algorithms, which are unbiased, are derived in the generic Population Monte Carlo statisti...
متن کاملOptimization of mesh hierarchies in multilevel Monte Carlo samplers
We perform a general optimization of the parameters in the Multilevel Monte Carlo (MLMC) discretization hierarchy based on uniform discretization methods with general approximation orders and computational costs. Moreover, we discuss extensions to non-uniform discretizations based on a priori refinements and the effect of imposing constraints on the largest and/or smallest mesh sizes. We optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemical Theory and Computation
سال: 2020
ISSN: 1549-9618,1549-9626
DOI: 10.1021/acs.jctc.9b01135